Directly reflective meta-programming
نویسندگان
چکیده
منابع مشابه
Directly reflective meta-programming
Existing meta-programming languages operate on encodings of programs as data. This paper presents a new meta-programming language, based on an untyped lambda calculus, in which structurally reflective programming is supported directly, without any encoding. The language features call-by-value and call-by-name lambda abstractions, as well as novel reflective features enabling the intensional man...
متن کاملDirectly Reflective Meta - Programming ∗ Aaron
Existing meta-programming languages operate on encodings of programs as data. This paper presents a new meta-programming language, based on an untyped lambda calculus, in which structurally reflective programming is supported directly, without any encoding. The language features call-by-value and call-by-name lambda abstractions, as well as novel reflective features enabling the intensional man...
متن کاملTowards a Fully-reflective Meta-programming Language
The term meta-programming language is used to describe languages that have some capability for manipulating code. A multi-stage language is a kind of meta-programming language that allows static typechecking of dynamically generated code. The expressiveness and type-safety of multi-stage languages have led to their success in many applications that require code generation. This paper presents t...
متن کاملReflective Autoepistemic Logic and Logic Programming
In this paper we show that reflexive autoepistemic logic of Schwarz is a particularly convenient modal formalism for studying properties of answer sets for logic programs with classical negation and disjunctive logic programs. Syntactical properties of logic programs imply that a natural interpretation of default logic in the logic of minimal knowledge (nonmonotonic S4F) provides also a modal r...
متن کاملRemote Store Programming: Reflective Memory for Multicore
This work presents remote store programming (RSP), an instance of the reflective memory model designed to be incrementally supportable on multicores that support loads and stores. To demonstrate the value of RSP, its performance is compared to that of both shared and distributed memory approaches using the TILEPro64 multicore processor. RSP is shown to be as much as 1.76× faster than distribute...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Higher-Order and Symbolic Computation
سال: 2008
ISSN: 1388-3690,1573-0557
DOI: 10.1007/s10990-007-9022-0